A Game Theoretic Approach to Irregular Repetition Slotted Aloha

نویسندگان

چکیده

Many technological enhancements are being developed worldwide to enable the “Internet of Things” (IoT). IoT networks largely rely on distributed access billions devices, but still lagging in terms combined reliability and low latency. To mend that shortcoming, it is paramount adapt existing random methods for setting. In this article, we shed light one modern candidates protocols fitted IoT: “Irregular Repetition Slotted ALOHA” (IRSA). As self-managing solutions needed overcome challenges IoT, study IRSA scheme a setting where groups users, with fixed traffic loads, competing ALOHA-type channel access. aim, adopt game-theoretic approach two classes devices learn autonomously their optimal protocol parameters optimize selfishly own effective throughput. Through extensive simulations, assess notable efficiency game based approach. We also show our attains Nash equilibrium (NE) via “better reply” strategy, quantify price anarchy comparison centralized Our results imply user competition does not fundamentally impact performance protocol.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Game-Theoretic Approach for NOMA-ALOHA

Non-orthogonal multiple access (NOMA) can improve the spectral efficiency by exploiting the power domain and successive interference cancellation (SIC), and it can be applied to various transmission schemes including random access that plays a crucial role in the Internet of Things (IoT) to support connectivity for a number of devices with sparse activity. In this paper, we formulate a game whe...

متن کامل

Achievability Bounds for T-Fold Irregular Repetition Slotted ALOHA Scheme in the Gaussian Multiple Access Channel

We address the problem of massive random access for an uncoordinated Gaussian multiple access channel (MAC). The performance of T-fold irregular repetition slotted ALOHA (IRSA) scheme for this channel is investigated. The main difference of this scheme in comparison to IRSA is as follows: any collisions of order up to T can be resolved with some probability of error introduced by Gaussian noise...

متن کامل

Finite Length Analysis of Irregular Repetition Slotted ALOHA in the Waterfall Region

A finite length analysis is introduced for irregular repetition slotted ALOHA (IRSA) that enables to accurately estimate its performance in the moderate-to-high packet loss probability regime, i.e., in the so-called waterfall region. The analysis is tailored to the collision channel model, which enables mapping the description of the successive interference cancellation process onto the iterati...

متن کامل

Selfish users in Aloha: a game-theoretic approach

Past studies of Aloha have emphasized system-wide goals such as achieving maximum throughput or minimum delay. In this paper, we use game theory to analyze Aloha from the perspective of a selfish user. We construct an Aloha game and examine the optimal behavior of individual users. We show that the Aloha game has an equilibrium and that an Aloha system in which the users are selfish will be sta...

متن کامل

Jamming Game in a Dynamic Slotted ALOHA Network

In this paper we suggest a development of the channel capacity concept for a dynamic slotted ALOHA network. Our object is to find maxmin successful transmissions of an information over a dynamic communication channel. To do so, we analyze an ALOHA-type medium access control protocol performance in the presence of a jammer. The time is slotted and the system is described as a zero-sum multistage...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2022

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2022.3140495